Trembling hand perfection is NP-hard
نویسنده
چکیده
It is NP-hard to decide if a given pure strategy Nash equilibrium of a given three-player game in strategic form with integer payoffs is trembling hand perfect.
منابع مشابه
The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements
The king of refinements of Nash equilibrium is trembling hand perfection. We show that it is NP-hard and Sqrt-Sum-hard to decide if a given pure strategy Nash equilibrium of a given three-player game in strategic form with integer payoffs is trembling hand perfect. Analogous results are shown for a number of other solution concepts, including proper equilibrium, (the strategy part of) sequentia...
متن کاملUsing Simulated Annealing to Calculate the Trembles of Trembling Hand Perfection
Within the literature on non-cooperative game theory, there have been a number of algorithms which will compute Nash equilibria. This paper shows that the family of algorithms known as Markov chain Monte Carlo (MCMC) can be used to calculate Nash equilibria. MCMC is a type of Monte Carlo simulation that relies on Markov chains to ensure its regularity conditions. MCMC has been widely used throu...
متن کاملTrembling Hand Equilibria of Plurality Voting
Trembling hand (TH) equilibria were introduced by Selten in 1975. Intuitively, these are Nash equilibria that remain stable when players assume that there is a small probability that other players will choose off-equilibrium strategies. This concept is useful for equilibrium refinement, i.e., selecting the most plausible Nash equilibria when the set of all Nash equilibria can be very large, as ...
متن کاملThe Miracle as a Randomization Device A Lesson from Richard Wagner’s Romantic Opera Tannhäuser und der Sängerkrieg auf Wartburg∗
In this paper we provide textual evidence on the sophistication of medieval deterrence strategies. Drawing on one of the great opera librettos based on medieval sources, Wagner’s Tannhäuser, we shall illustrate the use of optimal randomization strategies that can be derived by applying notions of dominance or trembling-hand perfection. Particular attention is paid to the employed randomization ...
متن کاملPropriétés géométriques du nombre chromatique : polyèdres, structures et algorithmes. (Geometric properties of the chromatic number : polyhedra, structure and algorithms)
Computing the chromatic number and finding an optimal coloring of a perfect graph can be done efficiently, whereas it is an NP-hard problem in general. Furthermore, testing perfection can be carriedout in polynomial-time. Perfect graphs are characterized by a minimal structure of their stable set polytope: the non-trivial facets are defined by clique inequalities only. Conversely, does a simila...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0812.0492 شماره
صفحات -
تاریخ انتشار 2008